Linear Maximum Rank Distance Codes of Exceptional Type

نویسندگان

چکیده

Scattered polynomials of a given index over finite fields are intriguing rare objects with many connections within mathematics. Of particular interest the exceptional ones, as defined in 2018 by first author and Zhou, for which partial classification results known. In this paper we propose unified algebraic description $\mathbb {F}_{q^{n}}$ -linear maximum rank distance codes, introducing notion linear codes index. Such connection naturally extends exceptionality scattered polynomial metric framework provides generalization Moore sets monomial MRD context. We move towards showing that ones zero generalized Gabidulin proving positive case code contains an same

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the genericity of maximum rank distance and Gabidulin codes

We consider linear rank-metric codes in Fqm . We show that the properties of being MRD (maximum rank distance) and non-Gabidulin are generic over the algebraic closure of the underlying field, which implies that over a large extension field a randomly chosen generator matrix generates an MRD and a non-Gabidulin code with high probability. Moreover, we give upper bounds on the respective probabi...

متن کامل

Error Performance Analysis of Maximum Rank Distance Codes

In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. We then use elementary linear subspaces to derive properties of maximum rank distance (MRD) codes that parallel those of maximum distance separable (MDS) codes. Using these properties, we show that, for MRD codes with error correction capability t, the deco...

متن کامل

Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring

Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such dist...

متن کامل

Maximum distance q -nary codes

t immaru-A q-nary error-correcting code with N = qk code words of length n = k + r can have no greater miniium distance d than r + 1. The class of codes for which d = r + 1 is studied first in general, then with the restriction that the codes be linear. Examples and construction methods are given to show that these codes exist for a number of values of q, k, and r. Proof: Pick any k position. T...

متن کامل

Non-Linear Maximum Rank Distance Codes in the Cyclic Model for the Field Reduction of Finite Geometries

In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the field reduction of finite geometries and we show that these families contain the non-linear maximum rank distance codes recently provided by Cossidente, Marino ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2023

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2023.3243682